Optimal oblivious routing in polynomial time
نویسندگان
چکیده
منابع مشابه
Optimal Oblivious Routing in Hole-Free Networks
We study oblivious routing algorithms in which the packet paths are constructed independently of each other. Oblivious algorithms are inherently distributed and they can be designed to efficiently balance the network utilization. We give an oblivious routing algorithm for the class of hole-free networks, in which the nodes are topologically embedded in simple areas of the plane. Such networks a...
متن کاملOptimal Oblivious Routing On D-Dimensional Meshes
In this work we consider deterministic oblivious k-k routing algorithms with buffer size O(k). Our main focus lie is the design of algorithms for dimensional n n meshes, d> 1. For these networks we present asymptotically optimal O(kpnd) step oblivious k-k routing algorithms for all k and d > 1.
متن کاملOptimal oblivious routing under statistical uncertainty
In telecommunication networks, a common measure is the maximum congestion (i.e., utilisation) on edge capacity. As traffic demands are often known with a degree of uncertainty, network management techniques must take into account traffic variability. The oblivious performance of a routing is a measure of how congested the network may get, in the worst case, for one of a set of possible traffic ...
متن کاملOblivious Polynomial Evaluation and Oblivious Neural Learning
We study the problem of Oblivious Polynomial Evaluation (OPE), where one party has a polynomial P and the other party, with an input x, wants to learn P (x) in an oblivious way. Previously existing protocols are based on some intractability assumptions that have not been well studied [10, 9], and these protocols are only applicable for polynomials over finite fields. In this paper, we propose e...
متن کاملOblivious Polynomial Evaluation
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P , and a receiver whose input is a value α. At the end of the protocol the receiver learns P (α) and the sender learns nothing. We describe efficient constructions for this protocol, which are based on new intractability assumptions that are closely related to noisy polynomial reconstructi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2004
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2004.04.010